Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup
نویسندگان
چکیده
منابع مشابه
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup
Srinivasan and Varghese [17] have proposed the use of multibit tries to represent routing tables used for Internet (IP) address lookups. They propose an dynamic programing algorithm to determine the strides for an optimal variable-stride trie that has at most levels. Here, is the number of prefixes in the routing table and is the length of the longest prefix. We improve on this algorithm by pro...
متن کاملPacket Classification Using Pipelined Multibit Tries
We propose heuristics for the construction of variable-stride one-dimensional as well as fixedand variablestride two-dimensional multibit tries. These multibit tries are suitable for the classification of Internet packets using a pipelined architecture. The variable-stride one-dimensional tries constructed by our heuristic require significantly less per-stage memory than required by optimal pip...
متن کاملOne-Dimensional Packet Classification Using Pipelined Multibit Tries
We propose a heuristic for the construction of variable-stride multibit tries. These multibit tries are suitable for one-dimensional packet classification using a pipelined architecture. The variable-stride tries constructed by our heuristic require significantly less per-stage memory than required by optimal pipelined fixed-stride tries. We also develop a tree packing heuristic, which dramatic...
متن کاملTree-Combined Trie: A Compressed Data Structure for Fast Ip Address Lookup
For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed IP address lookup engine is inevitable. Regarding the unpredictable variations occurred in the forwarding information during the time and space, the IP lookup algorithm should be able to customize itself with temporal and spatial conditions. This paper proposes a new ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کامل